Geometric dominating-set and set-cover via local-search
نویسندگان
چکیده
منابع مشابه
Geometric Dominating Set and Set Cover via Local Search
In this paper, we study two classic optimization problems: minimum geometric dominating set and set cover. In the dominating set problem, for a given set of objects as input, the objective is to choose minimum number of input objects such that every input object is dominated by the chosen set of objects. Here, one object is dominated by the other if both of them have non-empty intersection regi...
متن کاملHard Capacitated Set Cover and Uncapacitated Geometric Set Cover
The first part of this report describes the following result that, logarithmic approximation factor for hard capacitated set cover can be achieved from Wolsey's work [9], using a simpler and more intuitive analysis. We further show in our work, that O(log n) approximation factor can be achieved for the same problem by applying analysis of general set cover to analyze Wolsey's algorithm [5]. Thi...
متن کاملImproved Local Search for Geometric Hitting Set
Over the past several decades there has been steady progress towards the goal of polynomial-time approximation schemes (PTAS) for fundamental geometric combinatorial optimization problems. A foremost example is the geometric hitting set problem: given a set P of points and a set D of geometric objects, compute the minimum-sized subset of P that hits all objects in D. For the case where D is a s...
متن کاملSemidefinite relaxation for dominating set
‎It is a well-known fact that finding a minimum dominating set and consequently the domination number of a general graph is an NP-complete problem‎. ‎In this paper‎, ‎we first model it as a nonlinear binary optimization problem and then extract two closely related semidefinite relaxations‎. ‎For each of these relaxations‎, ‎different rounding algorithm is exp...
متن کاملGeometric Hitting Set and Set Cover Problem with Half-Strips
We show that hitting set and set cover problems with half-strips oriented in two opposite directions are NPcomplete.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Geometry: Theory and Applications
سال: 2023
ISSN: ['0925-7721', '1879-081X']
DOI: https://doi.org/10.1016/j.comgeo.2023.102007